Verified Methods for Computing Pareto Sets: General Algorithmic Analysis
نویسندگان
چکیده
منابع مشابه
Verified Methods for Computing Pareto Sets: General Algorithmic Analysis
In many engineering problems, we face multi-objective optimization, with several objective functions f1, . . . , fn. We want to provide the user with the Pareto set – set of all possible solutions x which cannot be improved in all categories (i.e., for which fj(x′) ≥ fj(x) for all j and fj(x′) > fj(x) for some j is impossible). The user should be able to select an appropriate trade-off between,...
متن کاملValidated Methods for Computing Pareto Sets: General Algorithmic Analysis
In many engineering problems, we face multi-objective optimization, with several objective functions f1, . . . , fn. We want to provide the user with the Pareto set – set of all possible solutions x which cannot be improved in all categories (i.e., for which fj(x′) ≥ fj(x) for all j and fj(x′) > fj(x) for some j is impossible). The user should be able to select an appropriate trade-off between,...
متن کاملFrom Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set computations that includes all these algorithms as particular cases. To make our algorithm understandable to people working in optimization and in game theory, we also provide motivations and explanations for our formal...
متن کاملA New Algorithmic Scheme for Computing Characteristic Sets
Ritt-Wu’s algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for computing generalized characteristic sets by introducing other admissible reductions than pseudo-division. A concrete subalgorithm is designed to triangulari...
متن کاملComputing Roadmaps of General Semi-Algebraic Sets
In this paper we study the problem of determining whether two points lie in the same connected component of a semi-algebraic set S. Although we are mostly concerned with sets S , our algorithm can also decide if points in an arbitrary set S R can be joined by a semi-algebraic path, for any real closed eld R. Our algorithm computes a one-dimensional semi-algebraic subset <(S) of S (actually of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Mathematics and Computer Science
سال: 2009
ISSN: 1641-876X
DOI: 10.2478/v10006-009-0031-5